Anonymous deniable predicate authentication scheme with revocability

In authentication protocols, anonymity is for privacy, while deniability is for anti-forensics after completion of the protocols. We propose a syntax and security definitions of an anonymous deniable predicate authentication scheme with revocability (rADPA). This new cryptographic primitive is to attain revocation function and strong privacy guarantee with predicate authentication, where a predicate is a boolean function over attributes of participants. We also give a generic construction of our rADPA scheme. Our approach is to build-in the revocable attribute-based encryption scheme proposed by K.Yamada et al. (ESORICS2017) into the anonymous deniable predicate authentication scheme proposed by S.Yamada et al. (PKC2012). Finally, we discuss how our rADPA scheme can be instantiated by employing concrete building blocks in our generic construction

A Proposal of One-Time Biometric Authentication

Abstract- In biometric authentication, feature information of each enrolled person’s biometric information is enrolled as templates. Secure databases or anti-tampered devices store the templates in general. The biometric information, however, is irreplaceable information, when it is compromised. Thereby, one must give a special attention to protection of such information. On the other hands, increasing internet economical services causes a motivation of implementing online biometric authentication. We propose a novel protection technique for the biometric information, especially the feature information and the templates. The point of our proposal is that the extracted features and the enrolled templates are transformed by one-time transformation that is generated in each authentication. The transformed features and templates travel through insecure communication line like the internet, and they are used in matching process. This technique causes security against eavesdropping and replay attacks on the internet, because the transmitted feature information and the templates are different every time